Time-slotted transmission over molecular timing channels
نویسندگان
چکیده
This work studies time-slotted communication over molecular timing (MT) channels. The transmitter, assumed to be perfectly synchronized in time with the receiver, is required to send K bits to the receiver using K information particles. It releases a single information particle in each time-slot, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrivals of the information particles during a finite-time observation window. The maximum-likelihood (ML) detector is derived in terms of the permanent of a matrix involving the arrival times, and shown to have an exponential computational complexity, thus, rendering it impractical. Therefore, two additional (practical) detectors are presented: The first is a symbol-by-symbol detector. The second is a sequence detector which is based on the Viterbi algorithm (VA), yet, the VA is used differently than in its common application in electromagnetic communications where the channels are linear. Numerical simulations indicate that the proposed sequence detection algorithm significantly improves the performance compared to the symbol-by-symbol detector. For a short number of transmitted symbols, the numerical results indicate that the performance of the proposed sequence detector closely approaches the performance of the highly complicatedML detector. Finally, the proposed sequence detector is numerically compared with a one-shot transmission scheme that releases all K particles simultaneously to send a single symbol out of a constellation of size 2K . It is shown that while for a small number of bits the one-shot scheme is better, when the number of bits is medium to large, the sequence detector achieves significantly better performance. © 2017 Elsevier B.V. All rights reserved.
منابع مشابه
Performance of slotted asynchronous CDMA using controlled time of arrival
A slotted asynchronous (SA) code-divison multipleaccess communication scheme controlling the time of arrival is proposed for distributed spread-spectrum packet radio networks where the transmission range is limited as in an indoor wireless system. In this scheme, each terminal can send its packet randomly at any one of Nw possible time instants, equally spaced over one period of direct-sequence...
متن کاملOn the Capacity of the Channel Aware Slotted Aloha over Rayleigh and Nakagami-m Channels
We consider the channel aware slotted ALOHA protocol that has been recently proposed to improve the capacity of the traditional slotted ALOHA by using multi-user diversity. This type of diversity is commonly used in scheduling policies that allow terminals to transmit when their channel conditions are good. Here, we focus on a decentralized random access protocol where users decide to transmit ...
متن کاملSingle-Carrier Frequency-Domain Equalization for Orthogonal STBC over Frequency-Selective MIMO-PLC channels
In this paper we propose a new space diversity scheme for broadband PLC systems using orthogonal space-time block coding (OSTBC) transmission combined with single-carrier frequency-domain equalization (SC-FDE). To apply this diversity technique to PLC channels, we first propose a new technique for combining SC-FDE with OSTBCs applicable to all dispersive multipath channels impaired by impulsive...
متن کاملAn Exact Combinatorial Analysis for the Performance Evaluation of Framed Slotted Aloha Systems with Diversity Transmission Over Erasable Wireless Channels
Framed Slotted Aloha (FSA) protocols are widely used in various communication systems. This paper investigates the performance of FSA systems that employ diversity transmission (DT) techniques over erasable wireless channels. Two DT schemes, DT-SWIR and DT-SWOR, differentiated by the underlying channel sampling procedures, i.e., sampling with/without replacement (SWIR/SWOR), are proposed. Modif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nano Comm. Netw.
دوره 12 شماره
صفحات -
تاریخ انتشار 2017